a bi-objective pre-emption multi-mode resource constrained project scheduling problem with due dates in the activities

نویسندگان

zahra sadat hosseini

javad hassan pour

emad roghanian

چکیده

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included in the activities. this paper tries to bridge this gap by studying tardiness mmrcpsp, in which the objective is to minimize total weighted tardiness and to maximize the net present value (npv). in order to solve the given problem, we introduced a non-dominated ranking genetic algorithm (nrga) and non-dominated sort genetic algorithm (nsga-ii). since the effectiveness of most meta-heuristic algorithms significantly depends on choosing the proper parameters. a taguchi experimental design method was applied to set and estimate the proper values of gas parameters for improving their performances. to prove the efficiency of our proposed meta-heuristic algorithms, a number of test problems taken from the project scheduling problem library (psplib) were solved. the computational results show that the proposed nsga-ii outperforms the nrga.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bi-objective Pre-emption Multi-mode Resource Constrained Project Scheduling Problem with due Dates in the Activities

In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...

متن کامل

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

the combinatorial multi-mode resource constrained multi-project scheduling problem

this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practica...

متن کامل

Using Multi-Objective Particle Swarm Optimization for Bi-objective Multi-Mode Resource-Constrained Project Scheduling Problem

In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used...

متن کامل

A multi-objective resource-constrained project scheduling problem with time lags and fuzzy activity durations

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of optimization in industrial engineering

ناشر: qiau

ISSN 2251-9904

دوره 7

شماره 15 2014

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023